Restricted isometry properties and nonconvex compressive sensing
نویسندگان
چکیده
In previous work, numerical experiments showed that ` minimization with 0 < p < 1 recovers sparse signals from fewer linear measurements than does ` minimization. It was also shown that a weaker restricted isometry property is sufficient to guarantee perfect recovery in the ` case. In this work, we generalize this result to an ` variant of the restricted isometry property, and then determine how many random, Gaussian measurements are sufficient for the condition to hold with high probability. The resulting sufficient condition is met by fewer measurements for smaller p. AMS classification scheme numbers: 94A12, 94A08, 94A20, 60F10 Restricted isometry properties and nonconvex compressive sensing 2
منابع مشابه
Recovery of Functions of Many Variables via Compressive Sensing
Recovery of functions of many variables from sample values usually suffers the curse of dimensionality: The number of required samples scales exponentially with the spatial dimension. In order to avoid this severe bottleneck, one needs to impose further structural properties of the function to be recovered apart from smoothness. Here, we build on ideas from compressive sensing and introduce a f...
متن کاملSparse Recovery Algorithms: Sufficient Conditions in terms of Restricted Isometry Constants
We review three recovery algorithms used in Compressive Sensing for the reconstruction s-sparse vectors x ∈ CN from the mere knowledge of linear measurements y = Ax ∈ Cm, m < N. For each of the algorithms, we derive improved conditions on the restricted isometry constants of the measurement matrix A that guarantee the success of the reconstruction. These conditions are δ2s < 0.4652 for basis pu...
متن کاملThe Restricted Isometry Property for Random Block Diagonal Matrices
In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparsevectors is possible from noisy, undersampled measurements via computationally tractable algorithms. Itis by now well-known that Gaussian (or, more generally, sub-Gaussian) random matrices satisfy the RIPunder certain conditions on the number of measurements. Their use can be limi...
متن کاملSparse signal recovery by $\ell_q$ minimization under restricted isometry property
In the context of compressed sensing, the nonconvex lq minimization with 0 < q < 1 has been studied in recent years. In this paper, by generalizing the sharp bound for l1 minimization of Cai and Zhang, we show that the condition δ(sq+1)k < 1
متن کاملConvergence of the Generalized Alternating Projection Algorithm for Compressive Sensing
The convergence of the generalized alternating projection (GAP) algorithm is studied in this paper to solve the compressive sensing problem y = Ax + . By assuming that AA> is invertible, we prove that GAP converges linearly within a certain range of step-size when the sensing matrix A satisfies restricted isometry property (RIP) condition of δ2K , where K is the sparsity of x. The theoretical a...
متن کامل